Section: New Software and Platforms

iProver Modulo

Keywords: Automated deduction - Automated theorem proving

Scientific Description: Integration of ordered polarized resolution modulo theory into the prover iProver.

Functional Description: iProver Modulo is an extension of the automated theorem prover iProver originally developed by Konstantin Korovin at the University of Manchester. It implements ordered polarized resolution modulo theory, a refinement of the resolution method based on deduction modulo theory. It takes as input a proposition in predicate logic and a clausal rewriting system defining the theory in which the formula has to be proved. Normalization with respect to the term rewriting rules is performed very efficiently through translation into OCaml code, compilation and dynamic linking. Experiments have shown that ordered polarized resolution modulo dramatically improves proof search compared to using raw axioms.

News Of The Year: Participation at the automated-theorem-prover competition CASC-26 Integration of version 2.5 of iProver, adding support for types (TFF0)

• Participant: Guillaume Burel

• Partner: ENSIIE

• Contact: Guillaume Burel

• Publications: A Shallow Embedding of Resolution and Superposition Proofs into the ??-Calculus Modulo - Experimenting with deduction modulo

• URL: http://www.ensiie.fr/~guillaume.burel/blackandwhite_iProverModulo.html.en